Locality-Conscious Load Balancing: Connectionist Architectural Support
نویسندگان
چکیده
Traditionally, in distributed memory architectures, locality maintenance and load balancing are seen as user level activities involving compiler and runtime system support in software. Such software solutions require an explicit phase of execution, requiring the application to suspend its activities. This paper presents the rst (to our knowledge) architecture-level scheme for extracting locality concurrent with the application execution. An artiicial neural network coprocessor is used for dynamically monitoring processor reference streams to learn temporally emergent utilities of data elements in ongoing local computations. This facilitates use of kernel-level load balancing schemes thus, easing the user programming burden. The kernel-level scheme migrates data to processor memories evincing higher utilities during load-balancing. The performance of an execution-driven simulation evaluating the proposed coprocessor is presented for three applications. The applications chosen represent the range of load and locality uxes encountered in parallel programs, with (a) static locality and load characteristics, (b) slowly varying localities for xed dataset sizes and (c) rapidly uctuating localities among slowly varying dataset sizes. The performance results indicate the viability and success of the coprocessor in concurrently extracting locality for use in load balancing activities.
منابع مشابه
Characterization of Locality Aware Task Scheduling Mechanism
The architectural features of modern computers highlight the need of parallel programming for sustained performance. This paper deals with task based programming to program modern computers. Due to lack of data locality, communication optimization and lack of task characterization support in an existing task scheduling, we intends to overview the characterization of locality aware task scheduli...
متن کاملA Probabilistic Analysis of a Locality Maintaining Load Balancing Algorithm
This paper presents a simple load balancing algorithm and its probabilistic analysis. Unlike most of the previous load balancing algorithms, this algorithm maintains locality. We show that the cost of this load balancing algorithm is small for practical situations and discuss some interesting applications for data remapping. Index Terms Data locality, irregularity, load balancing, mapping, prob...
متن کاملBalancing locality and randomness in DHTs
Embedding locations in DHT node IDs makes locality explicit and, thereby, enables engineering of the trade-off between careful placement and randomized load balancing. This paper discusses hierarchical, topology-exposed DHTs and their benefits for content locality, and administrative control and routing locality. We thank the members and companies of the PDL Consortium (including EMC, Hewlett-P...
متن کاملBalancing Locality and Randomness in DHTs (CMU-CS-03-203)
Embedding locations in DHT node IDs makes locality explicit and, thereby, enables engineering of the trade-off between careful placement and randomized load balancing. This paper discusses hierarchical, topology-exposed DHTs and their benefits for content locality, and administrative control and routing locality. We thank the members and companies of the PDL Consortium (including EMC, Hewlett-P...
متن کاملA Probabilistic Analysis of a LocalityMaintaining Load Balancing
This paper presents a simple load balancing algorithm and its probabilistic analysis. Unlike most of the previous load balancing algorithms, this algorithm maintains locality. We show that the cost of this load balancing algorithm is small for practical situations and discuss some interesting applications for data remapping. Index Terms Data locality, irregularity, load balancing, mapping, prob...
متن کامل